COMMENT ⊗   VALID 00018 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00003 00002	From: Tom Binford <binford@su-whitney.ARPA>
C00005 00003	  Barbara Grosz
C00010 00004	From: Ernst W. Mayr <MAYR@SU-SCORE.ARPA>
C00013 00005	Date: Fri 21 Feb 86 14:43:42-PST
C00014 00006	From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
C00015 00007	AI "Gurus"
C00017 00008	Received: by su-whitney.arpa with Sendmail Tue, 9 Sep 86 15:44:35 pdt
C00021 00009	Please send in your nominations for speakers in the Computer Science
C00022 00010	Dear X:
C00023 00011	Subject: Stanford Computer Science Colloquium
C00026 00012	Subject: Stanford Computer Science Colloquium
C00029 00013	From: Fernando Pereira <PEREIRA@SRI-CANDIDE.ARPA>
C00032 00014	Subject: Computer Science Department Colloquium
C00034 00015	Frances E. Allen
C00035 00016	\input buslet
C00038 00017	\magnification =\magstephalf
C00042 00018	Subject: Computer Science Department Colloquium
C00044 ENDMK
C⊗;
From: Tom Binford <binford@su-whitney.ARPA>
To: floyd@score
Subject: colloquium


Dear Bob:

Here is the edited version of the file.  At the end is
a letter which was sent to speakers.

Tom






Mary Shaw; CMU Software Technology Institute 412-268-7731
Nov 11 ok; will be in Los Angeles Nov 12, 13 (Wed and Thurs)
Reddy; can arrange for fall;
Eustace Mendis who is in charge of the computer exhibit at The Technology
	Center, Toronto Museum




  Barbara Grosz
! Dr. Saul Amarel; 202-694-5922; yes
*  Dr. Robert Noyce (Gibbons) 408-987-8080 No, too busy now
* Dr. Gordon Moore (Gibbons) 408-987-8167
  Dr. J.M. Brady; 011-44-865-62264; does not have a ready topic
* Dr. Raj Reddy; RR29@a.cs.cmu.edu; 412-268-2597; out of country until Apr 1;
* Prof Marvin Minsky
* Prof Alan Newell
* Prof Simon



		Graphics
  Lauren Carpenter; Pixel; 415-499-3600; no, too busy
! Alvie Ray Smith; Pixel; 415-499-3600; scheduled
* Dr. James Blinn; 818-577-9699; 9051; mechanical universe;  wait; possibly May
  contact again; very busy until Oct.
* Ken Perlin; 212-239-6767; Ara Greenberg Assoc; NY
! Carl Rosendahl; Pacific Data Images; 408-745-6755
* Al Barr; Caltech
* Jim Kajiya; Caltech
* Brian Barsky; UCB
* NASA Ames; flight simulators and supercomputers


		Geometric Modeling
* Greenberg, Cornell
* Wesley, IBM



* Ira Goldstein
* Mark Stefik
* Miro Benda, Boeing;
* de Kleer
* Byron Davies


* Bob Kahn;
* Larry Roberts

		Software Center-CMU
** software center-CMU
*  NFS-Sun Bill Keating

		AI
Mike Georgeff, SRI
Yoav Shoam; Yale; recent PhD
Kurt Konolige; resource-limited reasoning
John Laird - Xerox - SOAR architecture
Paul Rosenbloom  - SOAR architecture
Ramesh Patil - causal models of physiology; now VLSI
Yumi Iwasaki - working with Simon; formalization of causality


		Robotics
* ALV
* Steve Jacobsen
* Kanade
* Hopcroft
* Mumford
* Mundy
* Hinton - connectionism
* Scott Fahlman - connectionism


* Alan Kay
* Irene Greif-MIT-office automation



		Theory
! Steven Smael; linear programming; 415-642-4367; math Berkeley
* McGiddow; linear programming
* Umesh Vazirani (Andy Yao); statistical sampling and CS
* Dr. Joseph Goguen; SRI; assumes too much background


		Manufacturing
Dan DeBra


		Natural language
Barbara Grosz
Ray Perrault
Bob Berwick, MIT


		Hardware:  Parallel Computers; Commercial
Sequent
* Ousterhout; new design; Berkeley
* Kurzweil
* Xerox: Dragon, notebook
  Graham Nudd; no, returned to England

* Cal Quaite; ultradense memories; 
  is he a good speaker

Tilak Agerwala's group at Yorktown; 

Brent Hailpern		Smallworld
Tien Huyn		Architecture for Functional Programming
Ken Perry		Byzantine General's Problem
Harold Stone		Design of Cache Memory Systems
Jeanne Ferrante		Program Dependence Graphs
John Beetem		GF11 parallel processor
CN Liu			Advanced Image Presentation Techniques
Fran Allen		New directions in compilers/parallelism
Sanjaya Addanki		Paradigm for Problem Solving in AI









From: Ernst W. Mayr <MAYR@SU-SCORE.ARPA>


To: binford@SU-WHITNEY.ARPA

Tom,

As requested, here are some thoughts on the CS 500 process.

Once selection is made of the speakers for the quarter the following
steps should be taken:

1/ A list should be sent to Linda Zimmerman in TV for distribution to
   the TV students (including title and abstract for each).

2/ On Friday morning a memo should be given to Tina Contreras indicating
   speaker/title/abstract for the second week following (for example,
   on Feb. 14 she should have the speaker, etc. for the talk on Feb. 25)
   so that she can notify Campus Report and Stanford Daily. Based on this
   same memo she can add the talk to her colloquium message sent out weekly.

3/ Any handouts for the class should also be sent to Linda Zimmerman in TV
   for distribution to the TV students.

4/ For additional advertising, I sent out an electronic message to COLLOQ
   two weeks prior to the talk and one day prior to the talk with speaker/
   title/abstract.

5/ At 3:50 in the Lounge at MJH there is "cookie time" which is attended
   by the speaker -- for mingling with the students. This is arranged by
   the students.

6/ Notify Ben in TV of any equipment needs the speaker may have at least
   two days prior to the talk.

7/ TV has a "guideline" for guest speakers which should be sent to the
   speakers. (I'll put one in your mail slot.)

You might also want to check with Ernst Mayr for some input on this.
And if I think of anything else, I'll let you know.

-Anne
-------


Date: Fri 21 Feb 86 14:43:42-PST
From: Andrew Yao <YAO@SU-SCORE.ARPA>
Subject: colloquia

Tom, I heard that you will be coordinating the Department Colloquia for
the Spring.  I would like to recommend a speaker, Umesh Vazirani, for
giving a talk in the series, preferably early next quarter.  The talk
is about statistical sampling and computer science.  I can ask him to
give you a title and abstract, if you can accommodate him in your schedule.
Thanks.
-- Andy
-------


From: Carolyn Tajnai <TAJNAI@SU-SCORE.ARPA>
Subject: CS500 spring quarter


Tom, Dr. Byron Davies of Texas Instruments is a CIS Resident
Visitor; he has done a lot of research with the KSL.
I asked him if he would like to present a seminar
spring quarter and he said he would be happy to do so.

His subject is "Carel: A Visible Distributed Lisp"

Do you have an open date for spring quarter?

Carolyn
-------



AI "Gurus"

HP      Ira Goldstein runs AI lab
        Steve Rosenberg, Expert Systems

Sperry  a) Knowledge Systems Center
           Larry Walker  612/851-3100
            -The company-wide facilitator on AI.  About 50
             AI projects - don't know how many involve manufacturing.

        b) Research Lab for AI and Signal Processing
           Stu Brodsky

3M      Tim McCullough, CERC, Manager, Software R & D
         Bldg. 260-6A-08    612/733-9364

Boeing  Boeing Artifgicial Intelligence Center
        Miroslav Benda    206/763-5761

Douglas  C. W. Egberts    213/593-1184

FMC     Perry Thorndyke   AI Center Director
        Andy Chang        EECS Manager

GE      Ask Mel Simmons:  Bldg. Ka, Room 5C36
                          General Electric  
                          Schenectady, NY 12345
GM      Ruth Zarger  CAD/CAM    313/443-3152  (works with Teknowledge)

Lockheed 
       J.R. Zumsteg
       Advanced Softwrae Lab
      Lockheed Missiles and Space
       1801 Page MIll Road
       415/858-6718


Received: by su-whitney.arpa with Sendmail; Tue, 9 Sep 86 15:44:35 pdt
Date: Tue, 9 Sep 86 15:44:35 pdt
From: Premla Nangia <pam>
To: binford
Subject: Colloquium Letter

@device(Imprint10)
@make(letterhead,phone"497-2797",who"Thomas O. Binford",what "Professor (Research)",
Department CSD)

@begin(address)
Mr. Jim Blinn
Mail Station 510-110
Jet Propulsion Laboratory
4800 Oak Grove Dr
Pasadena, CA 91109

@end(address)

@greeting(Dear Mr. Blinn:)

@begin(body)

The intent of the Colloquium series is to showcase technical 
lectures by distinguished speakers  for a high-level technical audience
of interested non-specialists. Speakers bring to the series their
own valuable scientific contributions: critical surveys of technical areas; 
new results and emerging concepts; intellectual issues for the future.
The goal is to communicate the technical issues and problems,
the scientific excitement, and the environment of computer science.

The Colloquium of the Stanford Computer Science Department is held
at 4:15 pm, Tuesday during sessions, holidays excepted. 
Students arrange a meeting at 3:50 pm for the speaker to mingle with students;
cookies and refreshments are provided.

The local audience includes graduate students from first year to
advanced, faculty, and research staff from nearby research institutes
and companies.  The Colloquium is televised to local industry where it
reaches an audience involved with Stanford educational programs.



A set of guidelines for speakers for tv presentation is included.
Title and abstract are required two weeks in advance for distribution.
The tv staff need two days notice in advance for equipment needs.

We request speakers to sign a release to permit coverage of
the colloquium by television over the tv network to companies
in the immediate area, and to other divisions of these companies 
by videotape outside the Bay Area. 





@end(body)
Sincerely,





Thomas O. Binford




Please send in your nominations for speakers in the Computer Science
Colloquium series to Prof. Robert Floyd (RWF@sail, 723-1565; 493-5195).

Dear X:

You have been suggested as a speaker in our departmental colloquium
series, Tuesday afternoons at 4:15 PM. If you would like to discuss
the possibility, please call me at (415) 723-1565 or (415) 493-5195,
or send me E-mail.

Robert W. Floyd
Professor
Subject: Stanford Computer Science Colloquium
	 Tuesday, October 14, 1986, 4:15 PM
	 Terman Auditorium



THE INFORMATION LENS:  
AN INTELLIGENT SYSTEM FOR INFORMATION SHARING AND COORDINATION

Prof. Thomas W. Malone
LCS
M.I.T.
545 Technology Square
Cambridge, MA  02139
						
This talk will describe an intelligent system that (1) helps people filter, 
sort, and prioritize electronic messages they receive, (2) helps them find 
useful messages or other documents they would not otherwise have seen, and 
(3) supports common actions they may take on receiving certain kinds of 
messages.  The system exploits concepts from artificial intelligence such as 
frames, production rules, and inheritance networks, but it avoids the unsolved
problems of natural language understanding by providing users with a rich set 
of semi-structured message templates.  

In addition to electronic mail, bulletin boards, and conferencing, this basic 
framework supports a surprising variety of other applications including 
information retrieval, calendar management, and task tracking.  The user 
interface for the system is based on a  consistent set of "direct manipulation"
editors that expose the underlying knowledge representations in a way that is 
simple for non-programmers to use and that can be incrementally adopted and 
enhanced by members of a group.



Subject: Stanford Computer Science Colloquium
	 Tuesday, October 21, 1986, 4:15 PM
	 Terman Auditorium


NANOCOMPUTERS AND MOLECULAR ENGINEERING


K. ERIC DREXLER, Visiting Scholar; Research Affiliate, MIT Artificial
Intelligence Laboratory; Author, "Engines of Creation."

ABSTRACT: The broad outlines of future technology will be set by the
limits of physical law, if we can develop means for approaching those
limits. Today, because we cannot directly manipulate the atomic building
blocks of matter, we can make no more than a tiny fraction of the
physical structures permitted by natural law. But advances in
biotechnology and computational chemistry are opening a path to the
development of molecular assemblers able to build objects to complex
atomic specifications, removing this constraint and making possible
dramatic advances in many fields.  Among these advances will be
nanocomputers with parts of molecular size.  Mechanical nanocomputers --
molecular Babbage machines -- are amenable to design and analysis
with available techniques: this technology promises sub-micron computers
with gigahertz clock rates, nanowatt power dissipation, and RAM storage
densities in the hundreds of millions of terabits per cubic centimeter.










From: Fernando Pereira <PEREIRA@SRI-CANDIDE.ARPA>

Here is the abstract for my talk on the 28th -- FP
-----------------
A Localized Model of Concurrency

Fernando Pereira
Artificial Intelligence Center
SRI International


This talk is an informal overview of a structural theory of concurrency
jointly developed with Luis Monteiro of the New University in Lisbon.  The
main goal of the theory is to model the way in which local interactions
between components of a system lead to global behavior.  The theory, which
is based on the mathematical concept of sheaf, allows us to model precisely
the idea of processes interacting through common behavior at shared
locations.  In contrast to behavioral models, ours keeps track of the
individual contributions of subsystems to overall system behavior, allowing
a finer-grained analysis of subsystem interactions.  Specific results of the
theory include a non-interleaving model of synchronous communication and a
rigorous structural account of a common intuition about systems with a
potential for deadlock.  

The development of the theory has been motivated by difficulties in
capturing the notion of local interaction in the semantics of concurrent
logic-programming languages and in theories of knowledge and action in
artificial intelligence.
-------

Subject: Computer Science Department Colloquium
	 Tuesday, November 11, 1986
	 4:15 PM, Terman Auditorium

Dr. Amos Fiat
Dept. of EE & CS
University of California
Berkeley, CA 94720	642-0572

"How to Prove Yourself: Practical Solutions to Identification
and Signature Problems"

Amos Fiat and Adi Shamir


We describe simple identification and signature schemes which enable
any user to prove his identity and the authenticity of his messages
to any other user without shared or public keys.

The schemes are provably secure against any known or chosen message
attack if factoring is difficult, and typical implementations require
only 1% to 4% of the number of modular multiplications required
by the RSA scheme.




Frances E. Allen
IBM Research
H2/B40
P.O. Box 218
Yorktown Heights, NY 10598	914-789-7518

December 9

"Compiling for Parallelism"
\input buslet
%another letter.file
\def \ip#1{\par\penalty-1000\noindent\hangindent20pt\hangafter1
\hbox to 20pt{#1\hfill}\ignorespaces}

\memoto  Computer Science Colloquium Speakers


\from  Robert W. Floyd 

\subject Use of graphics on television

\body

%Put your letter here.
All lectures in the Computer Science Colloquium series are broadcast
on the Stanford Instructional TV Network to our industrial affiliates,
and are preserved on video tape in our libraries. We encourage you
to use types of graphic presentations that lend themselves to high
quality TV presentations.

The TV screen has roughly a 4 to 3 width-to-height ratio, so material
meant to be seen without camera movement can best be magnified in
that format.  

Light text or graphs on dark backgrounds become unintelligible in
TV transmission; please try to avoid such graphics.

Thirty-five mm slides and overhead projector transparencies are
acceptable.  They are projected on a screen, and the image is
televised. The best quality image, however, is obtained directly
from black (or very dark) type on white paper; a ceiling-mounted
zoom camera transmits the image, viewed locally on color monitors.

Typewriter and book type fonts are too small for intelligibility;
24 point (1/2 inch height) is recommended. Computer printouts are
hopeless.  Lines and points in graphics should be thick.

Oh, one more thing: avoid overexposure, don't wear white.

RWF/rfn
%\smallskip
%Enclosure: U.N.\ Fellowship award letter
%\smallskip
%cc: 
%\smallskip
%\ps
%P.S.: whatever you wish to say here

\endletter
\end
\magnification =\magstephalf
\input buslet
\def\disleft#1:#2:#3\par{\par\hangindent#1\noindent
			 \hbox to #1{#2 \hfill \hskip .1em}\ignorespaces#3\par}
\def\display#1:#2:#3\par{\par\hangindent #1 \noindent
			\hbox to #1{\hfill #2 \hskip .1em}\ignorespaces#3 \par}
\def\adx#1:#2\par{\par\halign{\hskip #1##\hfill\cr #2}\par}


\rwflet

\vskip 30pt
	
\address 






\body
Dear 

I have scheduled your talk here for             
Please let me know that this date is satisfactory.

The intent of the Colloquium series is to showcase technical 
lectures by distinguished speakers  for a high-level technical audience
of interested non-specialists. Speakers bring to the series their
own valuable scientific contributions: critical surveys of technical areas; 
new results and emerging concepts; intellectual issues for the future.
The goal is to communicate the technical issues and problems,
the scientific excitement, and the environment of computer science.

The Colloquium of the Stanford Computer Science Department is held
at 4:15 pm, Tuesday in Terman Auditorium during sessions, holidays excepted. 
Students arrange a meeting at 3:50 pm for the speaker to mingle with students;
cookies and refreshments are provided.

The local audience includes graduate students from first year to
advanced, faculty, and research staff from nearby research institutes
and companies.  The Colloquium is televised to local industry where it
reaches an audience involved with Stanford educational programs.

A set of guidelines for speakers for tv presentation is included.
Title and abstract are required two weeks in advance for distribution.
The tv staff need two days notice in advance for equipment needs.

We request speakers to sign a release to permit coverage of
the colloquium by television over the tv network to companies
in the immediate area, and to other divisions of these companies 
by videotape outside the Bay Area. 


\closing
Sincerely yours,
Robert W.~Floyd 

\annotations
RWF/rfn
\smallskip
Enclosures
%\smallskip
%cc: Matthew Kahn
%\smallskip
%\ps
%P.S.: whatever you wish to say here

\endletter

\makelabel
\end
Subject: Computer Science Department Colloquium
	 Tuesday, November 18, 1986
	 4 PM, Terman Auditorium

Peter Hart
Syntelligence
Box 3620
Sunnyvale, CA 94088

KNOWLEDGE PROGRAMMING USING FUNCTIONAL REPRESENTATIONS

Syntel is a novel knowledge representation language that provides
traditional features of expert system shells within a pure 
functional programming paradigm. It differs sharply, however,
from existing functional languages in many ways, ranging from
its ability to deal with uncertainty to its evaluation procedures.
A very flexible user-interface facility, tightly integrated with
the SYNTEL interpreter, gives the knowledge engineer full control
over both form and content of the end-user system.  SYNTEL executes
in both LISP machine and IBM mainframe/workstation environments,
and has been used to develop large knowledge bases dealing with
the assessment of financial risks. This talk will present an
overview of its architecture, as well as describe the real-world
problems that motivated its development.